Partial Results on Convex Polyhedron Unfoldings
نویسنده
چکیده
This paper is submitted for credit in the Algorithms for Polyhedra course at the University of Waterloo. We discuss a long-standing open problem in computational geometry and prove some partial results.
منابع مشابه
Local Overlaps In Special Unfoldings Of Convex Polyhedra
We define a notion of local overlaps in polyhedron unfoldings. We use this concept to construct convex polyhedra for which certain classes of edge unfoldings contain overlaps, thereby negatively resolving some open conjectures. In particular, we construct a convex polyhedron for which every shortest path unfolding contains an overlap. We also present a convex polyhedron for which every steepest...
متن کاملSpiral Unfoldings of Convex Polyhedra
The notion of a spiral unfolding of a convex polyhedron, resulting by flattening a special type of Hamiltonian cut-path, is explored. The Platonic and Archimedian solids all have nonoverlapping spiral unfoldings, although among generic polyhedra, overlap is more the rule than the exception. The structure of spiral unfoldings is investigated, primarily by analyzing one particular class, the poly...
متن کاملA Class of Convex Polyhedra with Few Edge Unfoldings
We construct a sequence of convex polyhedra on n vertices with the property that, as n→∞, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does have (several) nonoverlapping edge unfoldings.
متن کاملRefold rigidity of convex polyhedra
We show that every convex polyhedron may be unfolded to one planar piece, and then refolded to a different convex polyhedron. If the unfolding is restricted to cut only edges of the polyhedron, we identify several polyhedra that are “edge-unfold rigid” in the sense that each of their unfoldings may only fold back to the original. For example, each of the 43,380 edge unfoldings of a dodecahedron...
متن کاملExamples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes
We investigate how to make the surface of a convex polyhedron (a polytope) by folding up a polygon and gluing its perimeter shut, and the reverse process of cutting open a polytope and unfolding it to a polygon. We explore basic enumeration questions in both directions: Given a polygon, how many foldings are there? Given a polytope, how many unfoldings are there to simple polygons? Throughout w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004